Dynamic trading under integer constraints
نویسندگان
چکیده
منابع مشابه
Optimal rounding under integer constraints
Given N real numbers whose sum is an integer, we study the problem of finding N integers which match these real numbers as closely as possible, in the sense of Lp norm, while preserving the sum. We describe the structure of solutions for this integer optimization problem and propose an algorithm with complexity O(N logN) for solving it. In contrast to fractional rounding and randomized rounding...
متن کاملOn Stochastic Integer Programming under Probabilistic Constraints
We consider stochastic programming problems with probabilistic constraints in volving integer valued random variables The concept of p e cient points of a prob ability distribution is used to derive various equivalent problem formulations Next we modify the concept of r concave discrete probability distributions and analyse its relevance for problems under consideration These notions are used t...
متن کاملGlobal Supply Chain Management under Carbon Emission Trading Program Using Mixed Integer Programming and Genetic Algorithm
In this paper, the transportation problem under the carbon emission trading program ismodelled by mathematical programming and genetic algorithm. Since green supply chain issuesbecome important and new legislations are taken into account, carbon emissions costs are included inthe total costs of the supply chain. The optimisation model has the ability to minimise the total costsand provides the ...
متن کاملTime Warping Under Dynamic Constraints
Action and event recognition from video require comparing temporal sequences of images, or of intermediate representations derived from them. Such a comparison should be insensitive to intrinsic temporal variations within the same class – for instance the speed of execution of a particular gesture – and at the same time retain discriminative power to enable classifying different actions. In thi...
متن کاملConvex duality in mean-variance hedging under convex trading constraints
We study mean-variance hedging under portfolio constraints in a general semimartingale model. The constraints are formulated via predictable correspondences, meaning that the trading strategy is restricted to lie in a closed convex set which may depend on the state and time in a predictable way. To obtain the existence of a solution, we first establish the closedness in L2 of the space of all g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finance and Stochastics
سال: 2018
ISSN: 0949-2984,1432-1122
DOI: 10.1007/s00780-018-0369-3